A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA
نویسنده
چکیده
In recent years there has been a great deal of work done on secret sharing schemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a critical comparison of two of these Schemes based on Latin Squares [3] and RSA [9]. These two protocols will be examined in terms of their positive and negative aspects of their secuirty.
منابع مشابه
A Comparison Between Secret Sharing Schemes Based on Latin Squares and RSA
In this report we examine two secret sharing schemes which are based on different constructions. We present Cooper, Donovan and Seberry’s [6], Secret Sharing Scheme Arising from Latin Squares. Secondly we present Shoup’s threshold protocol based on the RSA digital signature algorithm. These two protocols will be compared in terms of their positive and negative aspects of their security.
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملConstructing Orthogonal Latin Squares from Linear Cellular Automata
We undertake an investigation of combinatorial designs engendered by cellular automata (CA), focusing in particular on orthogonal Latin squares and orthogonal arrays. The motivation is of cryptographic nature. Indeed, we consider the problem of employing CA to define threshold secret sharing schemes via orthogonal Latin squares. We first show how to generate Latin squares through bipermutive CA...
متن کاملSharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode
In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CR/0308027 شماره
صفحات -
تاریخ انتشار 2003